Generic Construction of Privacy-Preserving Optimistic Fair Exchange Protocols
نویسندگان
چکیده
Privacy-preserving optimistic fair exchange (POFE) is a kind of protocols which aim to solve the fairness problem in the exchange of digital signatures between two parties and in the meanwhile protect their privacy. In POFE, no one else including the semi-trusted third party in charge of arbitration can confirm an exchange even after resolving a dispute. In this paper we present a black-box construction of POFE based on a tag-based public key encryption scheme and a standard digital signature scheme. Our construction follows the ‘sign-then-encrypt’ paradigm, and is secure in the standard model. Our construction is generic and admits more instantiations of POFE.
منابع مشابه
Optimistic Protocols for Fair Exchange
We describe a generic protocol for fair exchange of electronic goods with non-repudiation. Goods can be signatures (i.e., non-repudiation tokens of public data), confidential data, or payments. The protocol does not involve a third party in the exchange in the faultless case but only for recovery.
متن کاملA traceable optimistic fair exchange protocol in the standard model
An Optimistic Fair Exchange (OFE) protocol is a good way for two parties to exchange their digital items in a fair way such that at the end of the protocol execution, both of them receive their items or none of them receive anything. In an OFE protocol there is a semi-trusted third party, named arbitrator, which involves in the protocol if it is necessary. But there is a security problem when a...
متن کاملA Privacy-Preserving Buyer-Seller Watermarking Protocol Based on Priced Oblivious Transfer
Buyer-seller watermarking protocols allow copyright protection of digital goods. To protect privacy, some of those protocols provide buyers with anonymity. However, anonymous e-commerce protocols pose several disadvantages, like hindering customer management or requiring anonymous payment mechanisms. Additionally, no existing buyer-seller watermarking protocol provides fair exchange. We propose...
متن کاملEfficient Optimistic Fair Exchange Secure in the Multi-user Setting and Chosen-Key Model without Random Oracles
Optimistic fair exchange is a kind of protocols to solve the problem of fair exchange between two parties. Almost all the previous work on this topic are provably secure only in the random oracle model. In PKC 2007, Dodis et al. considered optimistic fair exchange in a multiuser setting, and showed that the security of an optimistic fair exchange in a single-user setting may no longer be secure...
متن کاملFair and Privacy-Preserving Multi-party Protocols for Reconciling Ordered Input Sets
In this paper, we introduce the first protocols for multi-party, privacy-preserving, fair reconciliation of ordered sets. Our contributions are twofold. First, we show that it is possible to extend the round-based construction for fair, two-party privacypreserving reconciliation of ordered sets to multiple parties using a multi-party privacy-preserving set intersection protocol. Second, we prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Internet Serv. Inf. Secur.
دوره 7 شماره
صفحات -
تاریخ انتشار 2017